Two hypergraph theorems equivalent to ${\rm BPI}$.
نویسندگان
چکیده
منابع مشابه
Graph Coloring Compactness Theorems Equivalent to BPI
We introduce compactness theorems for generalized colorings and derive several particular compactness theorems from them. It is proved that the theorems and many of their consequences are equivalent in ZF set theory to BPI, the Prime Ideal Theorem for Boolean algebras. keywords: generalized graph colorings, compactness, prime ideal theorem MSC: 05C15; 03E25 .
متن کاملRepresentation Theorems for Hypergraph Satisfiability
Given a set of propositions, one can consider its inconsistency hypergraph. Then the satisfiability of sets of clauses with respect to that hypergraph (see [1], [6]) turns out to be the usual satisfiability. The problem is which hypergraphs can be obtained from sets of formulas as inconsistency hypergraphs. In the present paper it is shown that this can be done for all hypergraphs with countabl...
متن کاملDensity Theorems and Extremal Hypergraph Problems
We present alternative proofs of density versions of some combinatorial partition theorems originally obtained by H. Furstenberg and Y. Katznelson. These proofs are based on an extremal hypergraph result which was recently independently obtained by W. T. Gowers and B. Nagle, V. Rödl, M. Schacht, J. Skokan by extending Szemerédi’s regularity lemma to hypergraphs.
متن کاملSome Restricted Lindenbaum Theorems Equivalent to the Axiom of Choice
Dzik (1981) gives a direct proof of the axiom of choice from the generalized Lindenbaum extension theorem LET. The converse is part of every decent logical education. Inspection of Dzik’s proof shows that its premise let attributes a very special version of the Lindenbaum extension property to a very special class of deductive systems. The problem therefore arises of giving a direct proof, not ...
متن کاملThe Grötzsch Theorems for the Hypergraph of Maximal Cliques
In this paper, we extend the Grötzsch Theorem by proving that the clique hypergraph H(G) of every planar graph is 3-colorable. We also extend this result to list colorings by proving that H(G) is 4-choosable for every planar or projective planar graph G. Finally, 4-choosability of H(G) is established for the class of locally planar graphs on arbitrary surfaces.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1990
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093635418